Quantum oblivious transfer and bit commitment protocols based on two non-orthogonal states coding
نویسنده
چکیده
Oblivious transfer protocols (R-OT and OT1) are presented based on nonorthogonal states transmission, and the bit commitment protocols on the top of OT1 are constructed. Although these OT protocols are all unconditional secure, the bit commitment protocols based on OT protocols are not secure against attack similar to that presented by no-go theorem.
منابع مشابه
Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications
We prove a general relation between adaptive and non-adaptive strategies in the quantum setting, i.e., between strategies where the adversary can or cannot adaptively base its action on some auxiliary quantum side information. Our relation holds in a very general setting, and is applicable as long as we can control the bit-size of the side information, or, more generally, its “information conte...
متن کاملQuantum oblivious transfer protocols based on EPR states
We describe efficient protocols for quantum oblivious transfer and for one-out-of-two quantum oblivious transfer. These protocols, which can be implemented with present technology, are secure against general attacks as long as the cheater can not store the bit for an arbitrarily long period of time.
متن کاملWhy classical certification is impossible in a quantum world
I give a simple proof that it is impossible to guarantee the classicality of inputs into any mistrustful quantum cryptographic protocol. The argument illuminates the impossibility of unconditionally secure quantum implementations of essentially classical tasks such as bit commitment with a certified classical committed bit, classical oblivious transfer, and secure classical multi-party computat...
متن کاملSimple, Near-Optimal Quantum Protocols for Die-Rolling
Die-rolling is the cryptographic task where two mistrustful, remote parties wish to generate a random D-sided die-roll over a communication channel. Optimal quantum protocols for this task have been given by Aharon and Silman (New Journal of Physics, 2010) but are based on optimal weak coin-flipping protocols which are currently very complicated and not very well understood. In this paper, we f...
متن کاملComposable Security in the Bounded-Quantum-Storage Model
We present a simplified framework for proving sequential composability in the quantum setting. In particular, we give a new, simulation-based, definition for security in the boundedquantum-storage model, and show that this definition allows for sequential composition of protocols. Damg̊ard et al. (FOCS ’05, CRYPTO ’07) showed how to securely implement bit commitment and oblivious transfer in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1306.5863 شماره
صفحات -
تاریخ انتشار 2013